Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ÇÐȸÁö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ÇÐȸÁö >
µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document :
8
/ 8
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
µ¥ÀÌÅÍ ½ºÆ®¸²¿¡ ´ëÇÑ ¿¬¼Ó ÁúÀǸ¦ À§ÇÑ ¿ì¼±¼øÀ§ ±â¹ÝÀÇ ÀǹÌÀû ºÎÇÏ Á¦ÇÑ
¿µ¹®Á¦¸ñ(English Title)
Semantic Load Shedding for Prioritized Continuous Queries over Data Streams
ÀúÀÚ(Author)
¹ÚÀç¼®
Á¶Çà·¡
¿ø¹®¼ö·Ïó(Citation)
VOL 21 NO. 01 PP. 0073 ~ 0086 (2005. 04)
Çѱ۳»¿ë
(Korean Abstract)
µ¥ÀÌÅÍ ½ºÆ®¸² °ü¸® ½Ã½ºÅÛ(Data Stream Management System: DSMS)Àº´ë·®ÀÇ µ¥ÀÌÅÍ ½ºÆ®¸²°ú ´Ù¼öÀÇ ¿¬¼Ó ÁúÀǸ¦ ó¸®ÇÏ´Â ½Ã½ºÅÛÀÌ´Ù. ½Ã½ºÅÛ¿¡ ÀԷµǴ µ¥ÀÌÅÍ ½ºÆ®¸²ÀÇ ¾çÀÌ ½Ã½ºÅÛÀÇ Ã³¸® ´É·ÂÀ» ÃÊ°úÇÒ °æ¿ì, DSMS´Â ÀÔ·Â µ¥ÀÌÅÍÀÇ ÀϺθ¦ ¹«½ÃÇÔÀ¸·Î½á ÀûÁ¤ ºÎÇϸ¦ À¯ÁöÇÑ´Ù. ±âÁ¸¿¡ ¿¬±¸µÈ µ¥ÀÌÅÍ ½ºÆ®¸²¿¡ ´ëÇÑ ÁúÀÇ ¾Ë°í¸®ÁòµéÀÇ °øÅëÀûÀÎ ¸ñÇ¥´Â ¸ðµç ÁúÀÇ °á°úµé »çÀÌÀÇ Æò±Õ ¿ÀÂ÷¸¦ ÁÙÀÌ´Â °ÍÀÌ´Ù. ÀÌ¿Í´Â ´Þ¸® º» ³í¹®¿¡¼´Â °¢ ÁúÀÇÀÇ ¿ì¼±¼øÀ§¸¦ °í·ÁÇÏ¿© Áß¿äÇÑ ÁúÀÇÀϼö·Ï ½Åºù¼º ÀÖ´Â °á°ú¸¦ Ãâ·ÂÇÏ´Â ºÎÇÏ Á¦ÇÑ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Áï, º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀº ÁúÀǸ¦ ½ÇÇàÇÏ´Â °¢ ÀÀ¿ëµéÀÇ Áß¿äµµ¸¦ ¹Ý¿µÇÏ¿© Â÷º°ÈµÈ QoS(Quality of Service)¸¦ Áö¿øÇÒ ¼ö ÀÖ´Ù. º» ³í¹®¿¡¼´Â ¸ðÀǽÇÇèÀ» ÅëÇØ Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀÇ ¼º´ÉÀ» Æò°¡ÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
The data stream management system (DSMS) has to handle high-volume and bursty data streams with large number of continuous queries. When the input rate of any data stream exceeds the system capacity, the DSMS has to shed load by dropping some fraction of the unprocessed data items. This paper proposes a new load shedding algorithm for queries over data streams. Unlike previous algorithms that try to reduce the average deviation of the estimated answers of all queries, the proposed algorithm considers the priority of each query so that more important queries can make more convincing outputs. As a result, the proposed algorithm can support differentiated quality of services by exploiting semantics inherent to applications. We also report the experiment results confirming the benefits of the proposed algorithm.
Å°¿öµå(Keyword)
µ¥ÀÌÅÍ ½ºÆ®¸²
¿¬¼Ó ÁúÀÇ
ºÎÇÏ Á¦ÇÑ
¼º´É Æò°¡
Data Stream
Continuous Query
Load Shedding
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.